SYNTHESIS OF (Ba,Pb)TiO3SOLID SOLUTION HAVING NO COMPOSITIONAL FLUCTUATION
نویسندگان
چکیده
منابع مشابه
Compositional Resource Invariant Synthesis
We describe an algorithm for synthesizing resource invariants that are used in the verification of concurrent programs. This synthesis employs bi-abductive inference to identify the footprints of different parts of the program and decide what invariant each lock protects. We demonstrate our algorithm on several small (yet intricate) examples which are out of the reach of other automatic analyse...
متن کاملSafraless Compositional Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, little of this theory has been reduced to practice. This is in contrast with model-checking theory, which has led to industrial development and use of formal verification tools. We see two main reasons for the lack of pra...
متن کاملSYNTHESIS OF PURINE ACYCLONUCLEOSIDES HAVING PRONOUNCED ANTIVIRAL ACTIVITY
The synthesis of a series of purine analogues of the acyclonucleoside compound 14 (acyclovir) is described. Compounds in this series have been shown to have pronounced activity against herpes virus-type l(HSV-1). The anti-viral activities of other analogs whose syntheses were recently reported [1] by us are also described
متن کاملBipartite subspaces having no LOCC-distinguishable bases
It is proved that there exist subspaces of bipartite tensor product spaces that have no orthonormal bases that can be perfectly distinguished by means of LOCC protocols. A corollary of this fact is that there exist quantum channels having sub-optimal classical capacity even when the receiver may communicate classically with a third party that represents the channel’s environment.
متن کاملExtremal graphs having no matching cuts
A graph G = (V, E) is matching immune if there is no matching cut in G. We show that for any matching immune graph G, |E| ≥ ⌈3(|V | − 1)/2⌉. This bound is tight, as we define operations that construct, from a given vertex, exactly the class of matching immune graphs that attain the bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemistry Letters
سال: 1982
ISSN: 0366-7022,1348-0715
DOI: 10.1246/cl.1982.1655